SEG – A Provably Secure Variant of El-Gamal

نویسنده

  • David Soldera
چکیده

The Zheng-Seberry (ZS) [9] encryption scheme was published in 1993 and was one of the first practical schemes that was considered secure against an adaptively chosen ciphertext adversary. This paper shows that the semantic security of the one-way hash variant of the ZS scheme is actually insecure against an adaptively chosen ciphertext adversary. Attempts to modify the ZS scheme resulted in a variant of El-Gamal that is provably secure against an adaptively chosen ciphertext adversary using standard public-key cryptography assumptions i.e. not the random oracle model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Artemia: a family of provably secure authenticated encryption schemes

Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...

متن کامل

A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

1 I n t r o d u c t i o n In this paper, we present and analyze a new public key cryptosystem that is provably secure against adaptive chosen ciphertext attack (as defined by Rackoff and Simon [20]). The scheme is quite practical, requiring just a few exponentiations over a group. Moreover, the proof of security relies only on a standard intractability assumption, namely, the hardness of the Di...

متن کامل

A Provably Secure Elliptic Curve Scheme with Fast Encryption

We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n, where n is an RSA modulus, and merges ideas from Paillier and Rabin related schemes. Despite the typical bit length of n, our encryption algorithm is faster than El Gamal elliptic curve cryptosystems. The one-wayness of the ne...

متن کامل

Public Key Encryption Algorithm and the Random Oracle

Cryptographic theory has provided a potentially invaluable notion for cryptographic practice: the idea of provable security. Unfortunately, theoretical work often gains provable security only at the cost of effciency. Schemes like standard RSA are efficient but not provably secured. There are schemes who are provably secured but are not efficient. However, there are encryption schemes, for eg. ...

متن کامل

PSEC { 3 : Provably Secure Elliptic Curve Encryption Scheme { V 3 (

We describe a new version of the elliptic curve encryption schemes PSEC (Provably Secure Elliptic Curve). PSEC{3 is a public-key encryption system that uses the elliptic curve El Gamal trapdoor function and two random functions (hash functions) as well as any semantically secure symmetric encryption scheme, such as the one-time pad, or any classical block-cipher. Furthermore, we de ne a new pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001